-
1 структурная рекурсия
Русско-английский словарь по электронике > структурная рекурсия
-
2 структурная рекурсия
Русско-английский словарь по радиоэлектронике > структурная рекурсия
-
3 формула
law, theorem* * *фо́рмула ж.1. formula (мн. formulae)в ви́де фо́рмул — by formulaeизображе́ние полинуклеоти́дных цепо́чек в ви́де фо́рмул о́чень громо́здко — the representation of polynucleotide chains by formulae is clumsyвходи́ть в фо́рмулу — enter into [in] a formula, enter a formulaвыводи́ть фо́рмулу — derive [develop, deduce] a formulaпо фо́рмуле — by formula, from the formulaфо́рмула примени́ма к x — x can be handled by (such and such) formula [equation]2. (состав, напр. удобрения) formulationасимптоти́ческая фо́рмула — asymptotic formulaбарометри́ческая фо́рмула — barometric height formulaфо́рмула Бе́йеса т. над. — Bayes' formulaфо́рмула Берну́лли ( в теории вероятностей) — Bernoulli distributionфо́рмула бино́ма Нью́тона — binomial formulaфо́рмула Вайцзе́ккера яд. физ. — Weizsacker's formulaвалова́я фо́рмула — molecular formulaфо́рмула Га́усса — Gauss formulaфо́рмула де Бро́йля ( в квантовой механике) — de Broglie relation, de Broglie equationинтерполяцио́нная фо́рмула — interpolation formulaфо́рмула интерполяцио́нная, Бе́сселя — Bessel's interpolation formulaфо́рмула интерполяцио́нная, Лагра́нжа — Lagrange's interpolation formulaфо́рмула интерполяцио́нная, Нью́тона — Newton's interpolation formulaфо́рмула интерполяцио́нная, Нью́тона, обра́тная — Newton's backward interpolation formulaфо́рмула интерполяцио́нная, Нью́тона, пряма́я — Newton's forward interpolation formulaисхо́дная фо́рмула — assumption formulaитерацио́нная фо́рмула — iterative formulaквадрату́рная фо́рмула — quadrature formulaколё́сная фо́рмула ж.-д. — wheel arrangementфо́рмула корне́й квадра́тного уравне́ния — quadratic formulaфо́рмула мо́щности — horse-power formulaфо́рмула обра́тного перехо́да — reverse formulaфо́рмула обра́тного преобразова́ния — inversion formulaо́пытная фо́рмула — empirical [experimental] formulaосновна́я фо́рмула — basic formulaфо́рмула оце́нки стат. — estimatorфо́рмула Пла́нка физ. — Planck radiation formula, Planck distribution lawфо́рмула подо́бия для турби́н — law of proportionality for homologous turbinesфо́рмула разме́рности — dimensional formulaфо́рмула расчё́та несу́щей спосо́бности сва́и — pile capacity formulaфо́рмула расчё́та сопротивле́ния сва́и — pile driving formulaрасчё́тная фо́рмула — design formulaрекурре́нтная фо́рмула — recurrence formulaрекурси́вная фо́рмула — recursion formulaстехиометри́ческая фо́рмула — stoichiometric formulaфо́рмула строе́ния физ. — atomic formulaструкту́рная фо́рмула — structural [constitutional] formulaфо́рмула сумми́рования — summation formulaто́чная фо́рмула — exact formulaфо́рмула Френе́ля — Fresnel's (reflection) formulaхими́ческая фо́рмула — chemical formulaхими́ческая, структу́рная фо́рмула — structural [constitutional] chemical formulaхими́ческая, эмпири́ческая фо́рмула — empirical chemical formulaцепна́я фо́рмула — chain formulaфо́рмула Эйнште́йна для фотоэффе́кта — Einstein photoelectric equation -
4 формула
1. ж. formulaизображение полинуклеотидных цепочек в виде формул очень громоздко — the representation of polynucleotide chains by formulae is clumsy
2. ж. formulation
См. также в других словарях:
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Structural induction — is a proof method that is used in mathematical logic (e.g., the proof of Łoś theorem), computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction. Structural recursion is a recursion… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Infinite loop — This article is about the programming term. For the street on which Apple Inc. s campus is located, see Infinite Loop (street). An infinite loop (also known as an endless loop) is a sequence of instructions in a computer program which loops… … Wikipedia
Universe (mathematics) — In mathematical logic, the universe of a structure (or model ) is its domain.In mathematics, and particularly in applications to set theory and the foundations of mathematics, a universe or universal class (or if a set, universal set – not to be… … Wikipedia
The Structure and Interpretation of the Computer Science Curriculum — is a monograph published in 2004 [Journal of Functional Programming, Volume 14 , Issue 4 (July 2004) Pages: 365 378 ] by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi comparing and contrasting the pedagogical… … Wikipedia
GrGen — GrGen.NET (Graph Rewrite GENerator, .NET version) is a graph transformation tool which generates efficient C# code (or .NET assemblies) out of declarative graph rewrite rule specifications. Graphs and graph rewrite rules are specified by… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic … Wikipedia
π-calculus — In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) … Wikipedia
